Language and Computation - PDFSEARCH.IO - Document Search Engine

Language and Computation
Results: 343

#	Item
281	Automata and Complexity in Multiple-Quantifier Sentence Verification Jakub Szymanik ([removed]) Institute for Logic, Language and Computation, University of Amsterdam Shane Steinert-Threlkeld (Shanest@stanford. Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-05-20 06:27:06 Science Automata theory Quantification Models of computation Formal languages Generalized quantifier Pushdown automaton Cognitive science Finite-state machine Logic Mathematical logic Semantics
282	Communication and Cooperation Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Communication has a positive effect on collaboration. Bicchieri, Lev-On, and Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-09-20 05:32:28 Social psychology Reputation management Sociology Accountability Social epistemology Trust Relevance Reciprocity Game theory Science Knowledge Ethics
283	Probabilistic semantic automata in the verification of quantified statements Jakub Dotlaˇcil ([removed]) Center for Language and Cognition, University of Groningen Jakub Szymanik ([removed]) In Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2014-04-30 09:18:26 Quantification Predicate logic Semantics Model theory Nondeterministic finite automaton S0 Finite-state machine Pushdown automaton Automata theory Models of computation Logic
284	Monotonicity has only a relative effect on the complexity of quantifier verification Jakub Szymanik∗ and Marcin Zajenkowski† 1 Institute for Logic, Language and Computation Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-11-29 06:14:30 Quantification Predicate logic Semantics Finite model theory Philosophical logic Generalized quantifier FO Sentence Model theory Logic Mathematical logic Theoretical computer science
285	Extracting Hybrid Automata from Control Code Steven Lyde, Matthew Might University of Utah, Salt Lake City, Utah, USA, {lyde,might}@cs.utah.edu Abstract. Formal methods—and abstract interpretation in particular— Add to Reading List Source URL: matt.might.net Language: English - Date: 2014-01-06 09:40:05 Models of computation Applied mathematics Hybrid automaton Computer science Hybrid system Model checking State transition system Formal language Actor model Differential equations Automata theory Mathematics
286	Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-07-13 09:14:28 Complexity classes Finite model theory Graph connectivity Game theory FO Reachability P Extensive-form game Tree Theoretical computer science Graph theory Mathematics
287	Peter Jansen, PhD CV and Graphical Portfolio PhD (Neural Computation and Cognitive Language Modeling), McMaster University BIS (Physics and Cognitive Artificial Intelligence), University of Waterloo Cognitive Add to Reading List Source URL: www.tricorderproject.org Language: English - Date: 2013-05-22 14:43:31 Ethology Neuroscience Cognitive science Artificial neural network Cognitive architecture Connectionism Cognitive model Psychology Cognitive Science Society Science Computational neuroscience Neural networks
288	ECSYM Part B1- Section 1d EVENTS, CAUSALITY AND SYMMETRY Glynn Winskel —the next-generation semantics Section 1d: Extended Synopsis Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2011-02-08 06:55:17 Models of computation Programming language semantics Applied mathematics Concurrency Denotational semantics Power domains Semantics Operational semantics Petri net Theoretical computer science Computer science Logic in computer science
289	ECSYM Part B2 EVENTS, CAUSALITY AND SYMMETRY Glynn Winskel Add to Reading List Source URL: www.cl.cam.ac.uk Language: English - Date: 2011-02-08 06:54:38 Applied mathematics Logic in computer science Programming language semantics Concurrency Denotational semantics Petri net Power domains Actor model Operational semantics Theoretical computer science Computer science Models of computation
290	Deterministic Pushdown Automata 237 Deterministic PDA (DPDA) A PDA P = (Q, Σ, Γ, δ, q0 , Z0 , F ) is deterministic if and only if Add to Reading List Source URL: www.cs.uiuc.edu Language: English - Date: 2005-10-18 14:54:39 Models of computation Computer science Applied mathematics Deterministic pushdown automaton Regular language Regular expression Context-free language Automata theory Formal languages Theoretical computer science

UPDATE